Response Time Stochastic Analysis for Fixed-Priority Stable Real-Time Systems

In this paper, we prove that a mean system utilization smaller than one is necessary condition for the feasibility of real-time systems. Such systems are defined as stable . Stable have two distinct states: transient state, followed by steady-state where same distribution response times repeated infinitely each task. We Liu and Layland theorem holds stable probabilistic with implicit deadlines, provide an analytical approximation those states bound instant when becomes steady.